Synthesizing fuzzy tree automata

Fuzzy tree automata are mathematical devices for modeling and analyzing vaguely defined structures. The behavior of a fuzzy automaton generates language by mapping set regular trees on ranked alphabet to membership values. It calculates the grade using rules that process their structural characteristics. This paper deals with constructing models satisfies given logical propositions (called properties) structure trees. Our goal is uncertainty synthesizing whose described linguistic variables. In this regard, we first provide several patterns heuristic tricks techniques satisfy simple properties. Then, develop method complex propositional formulas based conversion formula into computation tree, as well step-by-step combination models.